#include<algorithm>
#include<cstdio>
using namespace std;

int main(int argc, char *argv[])
{
	int n;
	scanf("%d",&n);

	while(n != 0)
	{
		int x[701],y[701];     int i,j,k,max=2;
		
		for(i=1;i<=n;i++)
			scanf("%d%d",&x[i],&y[i]);
		
		for(k=1;k<=n;k++)
		{
			int ns=1;
			double xy[701];	int ed=0;
			for(i=k+1;i<=n;i++)
				if(x[i]-x[k]==0)	ed++;
				else
					xy[ns++]=(double)(y[i]-y[k])/(double)(x[i]-x[k]);
			sort(&xy[1],&xy[ns]);
					
			int zhongjie=2;
			int sum=2;
			double comp=xy[1];
			for(i=2;i<ns;i++)
				if(comp==xy[i])
					sum++;
				else
				{
					comp=xy[i];
					zhongjie = sum > zhongjie ? sum : zhongjie;
					sum=2;
				}
			zhongjie = sum > zhongjie ? sum : zhongjie;
			max = zhongjie > max ? zhongjie : max;
			max = ed > max ? ed : max;
		}
		
		printf("%d\n",max);
		scanf("%d\n",&n);
	}
}


